package mst;

import java.util.Set;
import java.util.TreeSet;

import vj.graph.WeightedGraph;

public class MSTPrim {
	
	class Cost implements Comparable<Cost>{
		int v;
		int c;

		public Cost(int v, int c) {
			this.v = v;
			this.c = c;
		}
		
		@Override
		public int compareTo(Cost o) {
			return this.c - o.c;
		}

	}
	
	public void mst(WeightedGraph g, int s) {
		Set<Cost> pq = new TreeSet<Cost>();
		for(int i = 1; i <= g.V(); i++) {
			pq.add(new Cost(1, Integer.MAX_VALUE));
		}
		
	}
	
	

}
